#include <bits/stdc++.h>
using namespace std;

#ifndef ONLINE_JUDGE
    #include <bits/debug.h>
#endif

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += (int)(c))
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i <= (int)(b); i -= (int)(c))
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    string s;
    cin >> s;
    int n = sz(s);
    s = ' ' + s;
    set<char> ss;

    FOR(i, 1, n) ss.insert(s[i]);

    map<char, set<int>> mp;

    FOR(i, 'a', 'z') {
        if (ss.count(i)) {
            mp[i].insert(0);
            mp[i].insert(n + 1);
        }
    }

    FOR(i, 1, n) {
        mp[s[i]].insert(i);
    }

    int ans = 1e18;

    FOR(i, 'a', 'z') {
        if (!sz(mp[i])) continue;
        int t = 0;
        for (auto it = next(mp[i].begin()); it != mp[i].end(); it++) {
            int p = *it - *prev(it) - 1;
            int x = 0;
            while (p) {
                x++;
                p /= 2;
            }
            t = max(t, x);
        }
        ans = min(ans, t);
    }
    cout << ans << endl;
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> Task;
    while (Task--) {
        solve();
    }

    return 0;
}
